High-level message sequence charts

نویسندگان

  • Sjouke Mauw
  • Michel A. Reniers
چکیده

We study High-level Message Sequence Charts – a concept incorporated into MSC96 for composing MSCs explicitly. A formal semantics is given which extends the accepted process algebra semantics of MSC92. We assess the language by studying a simple example, which leads us to consider the extension of HMSC with gates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From High Level Message Sequence Charts to BDL Speci cations

This article describes the translation from Message Sequence Charts (a graphical language deening the behaviour of distributed systems) to Behaviour Description Language, a declarative object oriented reactive synchronous language.

متن کامل

Message Sequence Charts

Message sequence charts (MSCs) constitute an attractive visual formalism that is widely used to capture system requirements during the early design stages in domains such as telecommunication software. A version of MSCs called sequence diagrams is one of the behavioral diagram types adopted in the UML. In this chapter we survey MSCs and their extensions. In particular, we discuss high level MSC...

متن کامل

Message Sequence Charts for Assertion-based Verification

This paper presents a technique to generate SystemVerilog assertions directly from high-level specification constructs of Message Sequence Charts (MSC) to bridge the productivity gap for current complex designs. Commercial solutions for automated assertion generation do not currently exist. We argue that our technique does span across the hardware/software continuum, allowing it to be applied t...

متن کامل

Realizability of high-level message sequence charts: closing the gaps

We study the notion of safe realizability for high-level message sequence charts (HMSCs) (Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete (Greece), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 797–808). We show that safe realizability is EXPSPACE-complete for bounded HMSCs but undecidable for the class of a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997